Monadic Logic of Order over Naturals has no Finite Base
نویسندگان
چکیده
A major result concerning Temporal Logics (TL) is Kamp’s theorem [Kam68, GHR94], which states that the temporal logic over the pair of modalities X until Y and Xsince Y is expressively complete for the first order fragment of monadic logic of order over the natural numbers. We show that there is no finite set of modalities B such that the temporal logic over B and monadic logic of order have the same expressive power over the natural numbers. As a consequence of our proof, we obtain that there is no finite base temporal logic which is expressively complete for the μ-calculus.
منابع مشابه
Arity hierarchy for temporal logics
A major result concerning temporal logics is Kamp’s Theorem which states that the pair of modalities ‘‘until’’ and ‘‘since’’ is expressively complete for the first-order fragment of the monadic logic over the linear-time canonical model of naturals. The paper concerns the expressive power of temporal logics over trees. The main result states that in contrast to Kamp’s Theorem, for every n there...
متن کاملOn decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat,<) is decidable. A natural question is: what monadic predicates (sets) can be added to (Nat,<) while preserving decidability? Elgot and Rabin found many interesting predicates P for which the monadic theory of 〈Nat,<,P〉 is decidable. The Elgot and Rabin automata theoretical method has b...
متن کاملOn Expressive Power of Regular Expressions over Infinite Orders
Two fundamental results of classical automata theory are the Kleene theorem and the Büchi-Elgot-Trakhtenbrot theorem. Kleene’s theorem states that a language of finite words is definable by a regular expression iff it is accepted by a finite state automaton. Büchi-ElgotTrakhtenbrot’s theorem states that a language of finite words is accepted by a finite-state automaton iff it is definable in th...
متن کاملWeak Cost Monadic Logic over Infinite Trees
Cost monadic logic has been introduced recently as a quantitative extension to monadic second-order logic. A sentence in the logic defines a function from a set of structures to N∪{∞}, modulo an equivalence relation which ignores exact values but preserves boundedness properties. The rich theory associated with these functions has already been studied over finite words and trees. We extend the ...
متن کاملThe Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs
This paper begins an investigation of the monadic second-order logic of graphs and of sets of graphs, using techniques from universal algebra, and the theory of formal languages. (By a graph, we mean a finite directed hyperedge-labelled hypergraph, equipped with a sequence of distinguished vertices.) A survey of this research can be found in Courcelle [ 111. An algebraic structure on the set of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 12 شماره
صفحات -
تاریخ انتشار 2002